翻訳と辞書 Words near each other ・ Metric Arts ・ Metric Commission ・ Metric connection ・ Metric conversion ・ Metric Conversion Act ・ Metric derivative ・ Metric differential ・ Metric dimension ・ Metric dimension (graph theory) ・ Metric discography ・ Metric engine (American expression) ・ Metric expansion of space ・ Metric foot ・ Metric gauge ・ Metric Hosiery Company ・ Metric k-center ・ Metric map ・ Metric Martyrs ・ Metric mile ・ Metric modulation ・ Metric outer measure ・ Metric Pixel Canvas ・ Metric prefix ・ Metric signature ・ Metric space ・ Metric space aimed at its subspace ・ Metric Structures for Riemannian and Non-Riemannian Spaces ・ Metric system ・ Metric tensor ・ Metric tensor (general relativity) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Metric k-center ： ウィキペディア英語版 Metric k-center In graph theory, the metric ''k''-center or metric facility location problem is a combinatorial optimization problem studied in theoretical computer science. Given ''n'' cities with specified distances, one wants to build ''k'' warehouses in different cities and minimize the maximum distance of a city to a warehouse. In graph theory this means finding a set of ''k'' vertices for which the largest distance of any point to its closest vertex in the ''k''-set is minimum. The vertices must be in a metric space, or in other words a complete graph that satisfies the triangle inequality. ==Formal definition== Given a complete undirected graph ''G'' = (''V'', ''E'') with distances ''d''(''v''''i'', ''v''''j'') ∈ ''N'' satisfying the triangle inequality, find a subset ''S'' ⊆ ''V'' with |''S''| = ''k'' while minimizing: : $\backslash max\_\; \backslash min\_\; d(v,s)$ 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Metric k-center」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.